On conjugate points and the Leitmann equivalent problem approach

نویسنده

  • F. O. O. Wagener
چکیده

This article extends the Leitmann equivalence method to a class of problems featuring conjugate points. The class is characterised by the requirement that the set of indifference points of a given problem forms a finite stratification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the hybrid conjugate gradient method for solving fuzzy optimization problem

In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...

متن کامل

Optimum Shape Design of a Radiant Oven by the Conjugate Gradient Method and a Grid Regularization Approach

This study presents an optimization problem for shape design of a 2-D radiant enclosure with transparent medium and gray-diffuse surfaces. The aim of the design problem is to find the optimum geometry of a radiant enclosure from the knowledge of temperature and heat flux over some parts of boundary surface, namely the design surface. The solution of radiative heat transfer is based on the net r...

متن کامل

Lattice Boltzmann simulation of EGM and solid particle trajectory due to conjugate natural convection

The purpose of this paper is to investigate the EGM method and the behavior of a solid particle suspended in a twodimensional rectangular cavity due to conjugate natural convection. A thermal lattice Boltzmann BGK model is implemented to simulate the two dimensional natural convection and the particle phase was modeled using the Lagrangian–Lagrangian approach where the solid particles are treat...

متن کامل

FGP approach to multi objective quadratic fractional programming problem

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2010